Erratum to: Optimal minimal routing and priority assignment for priority-preemptive real-time NoCs
نویسندگان
چکیده
منابع مشابه
A Tighter Real-Time Communication Analysis for Wormhole-Switched Priority-Preemptive NoCs
Simulations and runtime measurements are some of the methods which can be used to evaluate whether a given NoCbased platform can accommodate application workload and fulfil its timing requirements. Yet, these techniques are often time-consuming, and hence can evaluate only a limited set of scenarios. Therefore, these approaches are not suitable for safety-critical and hard real-time systems, wh...
متن کاملOptimal Priority Assignment Algorithms for Probabilistic Real-Time Systems
In this paper we investigate the problem of optimal priority assignment in fixed priority pre-emptive single processor systems where tasks have probabilistic execution times. We identify three sub-problems which optimise different metrics related to the probability of deadline failures. For each sub-problem we propose an algorithm that is proved optimal. The first two algorithms are inspired by...
متن کاملEfficient Optimal Priority Assignment for Fixed Priority Preemption Threshold Scheduling
This paper proposes an efficient priority assignment algorithm for fixed priority preemption threshold scheduling (PTS), which we named FAST-TRAVERSE. It is optimal in the sense that it always finds a feasible priority assignment if one exists. While there are existing optimal algorithms, they are inefficient to be used in practice. The key ideas of FAST-TRAVERSE are to prune sibling traverses ...
متن کاملVirtual Priority Assignment Policy to Distributed Real-Time Transactions
In a distributed environment, tasks generally have processing demands at multiple sites. A distributed task is usually divided into several cohorts, each to be executed in order at some site. This paper deals with an important aspect of distributed real time transaction processing in distributed real-time databases, namely the problem of assigning priorities to transactions. In distributed real...
متن کاملSchedulability and Priority Assignment for Multi-Segment Self-Suspending Real-Time Tasks under Fixed-Priority Scheduling
Self-suspension is becoming an increasingly prominent characteristic in real-time systems such as: (i) I/O-intensive systems (ii) multi-core processors, and (iii) computation offloading systems with coprocessors, like Graphics Processing Units (GPUs). In this paper, we study the schedulability of multisegment self-suspension tasks under fixed-priority scheduling, where the executions of a multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2017
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-017-9278-3